randomized method造句
例句與造句
- Based on the randomized method , a randomized method with pretreatment is obtained for the design problem of fir digital filters with discrete coefficients
結(jié)合隨機(jī)擾動方法,得到了求解離散系數(shù)濾波器設(shè)計問題的一種帶預(yù)處理的隨機(jī)擾動算法。 - Compared with the conventional randomized method , the randomized method with pretreatment often yields a better sub - optimal performance and costs less cpu time
與隨機(jī)擾動方法相比,帶預(yù)處理的隨機(jī)擾動方法得到的次優(yōu)解的性能更好,需要的時間也大大減少。 - Students lead most of the class sessions in 15 . 099 , using the conference - quality presentations they have created . course readings revolve around this term ' s topic , randomized methods for deterministic optimization
在15 . 099課程中,大部分的課時由學(xué)生來領(lǐng)導(dǎo),使用學(xué)生自己做的達(dá)到學(xué)術(shù)會議標(biāo)準(zhǔn)的陳述報告。課程閱讀圍繞這學(xué)期的主題:確定性最佳化的隨機(jī)方法。 - In contrast to conventional optimization algorithms whose iterates are computed and analyzed deterministically , randomized methods rely on stochastic processes and random number / vector generation as part of the algorithm and / or its analysis
傳統(tǒng)的最優(yōu)化算法中迭代的計算和分析是確定的,與之相比,隨機(jī)方法依靠隨機(jī)過程和隨機(jī)數(shù)字/向量的生成作為算法和(或)算法分析的一部分。 - In keeping with the tradition of the last twenty - some years , the readings in optimization seminar will focus on an advanced topic of interest to a portion of the mit optimization community : randomized methods for deterministic optimization
與過去20多年的傳統(tǒng)一致,最佳化書報討論課程的重點(diǎn)將放在麻省理工學(xué)院一部分最佳化團(tuán)體感興趣的一個高級主題上:確定性最佳化的隨機(jī)方法。 - It's difficult to find randomized method in a sentence. 用randomized method造句挺難的
- In contrast to conventional optimization algorithms whose iterates are computed and analyzed deterministically , randomized methods rely on stochastic processes and random number / vector generation as part of the algorithm and / or its analysis
傳統(tǒng)的最佳化演算法中迭代的計算和分析是確定的,與之相比,隨機(jī)方法依靠隨機(jī)過程和亂數(shù)字/向量的生成作為演算法和(或)演算法分析的一部分。 - An equivalent integral programming model and a new semidefinite programming relaxation for the max - bisection problem are given . then , we solve the relaxation with a projected gradient algorithm . coupled with the randomized method , an approximate solution of the max - bisection problem is obtained
2 .給出圖的最大二等分問題的整數(shù)規(guī)劃模型的等價模型及其新的半定規(guī)劃松弛模型,利用投影梯度算法求解該半定規(guī)劃松弛模型,然后利用隨機(jī)擾動算法求得原問題的次優(yōu)解